Visibility Complexity of Animation in Flatland

We address in this paper the problem of measuring the visibility complexity of scene animation in flatland. In our previous work we proposed a complexity measure which quantifies the information transfer in a scene. Here we introduce a new measure based also on information theory in order to capture the complexity of movement. Our approach measures the dissimilarity between successive frames of an animation, using the variation of information exchange between each pair of patches. We present preliminary results which show that this approach attains a satisfactory animation classification.